Lossy Compression for Wireless Seismic Data Acquisition
نویسندگان
چکیده
منابع مشابه
Maximum Likelihood Estimation for Lossy Data Compression∗
In lossless data compression, given a sequence of observations (Xn)n≥1 and a family of probability distributions {Qθ}θ∈Θ, the estimators (θ̃n)n≥1 obtained by minimizing the ideal Shannon code-lengths over the family {Qθ}θ∈Θ, θ̃n := arg min θ∈Θ [ − logQθ(X 1 ) ] , whereXn 1 := (X1, X2, . . . , Xn), coincide with the classical maximum-likelihood estimators (MLEs). In the corresponding lossy compres...
متن کاملLossy Data Compression Using Logarithm
Lossy compression algorithms take advantage of the inherent limitations of the human eye and discard information that cannot be seen. [1] In the present paper a technique termed as Lossy Data Compression using Logarithm (LDCL) is proposed to compress incoming binary data in the form of a resultant matrix containing the logarithmic values of different chosen numeric sets. The proposed method is ...
متن کاملLossless and Lossy Data Compression
Data compression (or source coding) is the process of creating binary representations of data which require less storage space than the original data 7; 14; 15]. Lossless compression is used where perfect reproduction is required while lossy compression is used where perfect reproduction is not possible or requires too many bits. Achieving optimal compression with respect to resource constraint...
متن کاملLossy Compression of Elevation Data
Generic lossy image compression algorithms, such as Said & Pearlman's, perform excellently on gridded terrain elevation data. For example, an average DEM compressed down to 0.1 bits per point has an RMS elevation error of 3 meters, although di erent DEMs ranged from 0.25 to 15 meters. This performance compares favorably to compressing with Triangulated Irregular Networks. Preliminary tests also...
متن کاملPartition Reduction for Lossy Data Compression Problem
We consider the computational aspects of lossy data compression problem, where the compression error is determined by a cover of the data space. We propose an algorithm which reduces the number of partitions needed to find the entropy with respect to the compression error. In particular, we show that, in the case of finite cover, the entropy is attained on some partition. We give an algorithmic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
سال: 2016
ISSN: 1939-1404,2151-1535
DOI: 10.1109/jstars.2015.2459675